Modelling Ceteris Paribus Preferences with Deontic Logic

Abstract We present a formal semantics for deontic logic based on the concept of ceteris paribus preferences. introduce notions unconditional obligation and permission as well conditional that are interpreted relative to this semantics. show these satisfy some intuitive properties and, at same time, do not encounter problems paradoxes have been extensively discussed in literature. prove satisfiability problem our is NP. Finally, we fragment which content operator literal has an equivalent representation preference networks (CP-nets).